|
| |
|
|
Coalition Formation in Multiagent Systems Using Genetic Algorithms
Kučera, Tomáš ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
This thesis discusses the basics of software agents and the way they form the multiagent coalitions. Genetic algorithms are introduced as one of the methods of solving the coalition formation problem. MAPC 2018 competition is introduced, which inspired the final design and implementation of the solution by using the tools described. A demo project was created, in which agents communicate with the MASSim server and gather data which is then used as an input into the genetic algorithm. Its purpose is to assign the agents to the tasks based on the input data, so that the tasks can be accomplished in the most effective manner possible. The results of this algorithm are evaluated in experiments which are focused on the quality of the solutions found as well as the time required for the calculation.
|
|
|
Coalition Games in a Dynamic Multiagent Environment
Hamran, Peter ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
The essence of this bachelor thesis was to implement an algorithm for suitable coalition forming in multi-agent system. Suitable coalition denotes a coalition which is not formed in super-additive environment and so it depends on its size and members. Aim of this thesis was to adjust an algorithm for coalition bounds forming between agents in a way, that it is applicable in a multi-agent competition MASSIM. Key aspects are amount of messages sent between agents for coalition to form and also a time it takes to calculate all coalitional values required for such a process. Final scenario is where two competitive groups of agents compete for resources in a multi-agent system simulation.
|
|
|
Adventure Game with Intelligent Cooperating Actors
Vacek, Lukáš ; Samek, Jan (referee) ; Zbořil, František (advisor)
The goal of this master's thesis is to design and implement framework that can be used for development of agent systems. Framework is implemented in Java and encapsulates JADE library. Framework is used for implementation of adventure game. There are several characters (agents) with specific roles who cooperate and try to achieve their goals.
|
|
|
Coalition Games in a Dynamic Multiagent Environment
Hamran, Peter ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
The essence of this bachelor thesis was to implement an algorithm for suitable coalition forming in multi-agent system. Suitable coalition denotes a coalition which is not formed in super-additive environment and so it depends on its size and members. Aim of this thesis was to adjust an algorithm for coalition bounds forming between agents in a way, that it is applicable in a multi-agent competition MASSIM. Key aspects are amount of messages sent between agents for coalition to form and also a time it takes to calculate all coalitional values required for such a process. Final scenario is where two competitive groups of agents compete for resources in a multi-agent system simulation.
|
|
| |
|
|
Webová aplikace na tvorbu geoher
Smejkal, David
Smejkal, D. Web application for creating geogame. Bachelor thesis. Brno: Mendel University, 2018 The bachelor thesis deals with the design and implementation of the web application for creating geogame. Application allows user to create a route with points on the map and after that to each point to assign a game. The resulting route can be played by anyone. The thesis is divided into theoretical part, analysis, design and finally into implementation part, where are described examples that were essentials for the development of the application. In the implementation part is also described a testing.
|
|
|
Coalition Games in a Dynamic Multiagent Environment
Hamran, Peter ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
The essence of this bachelor thesis was to implement an algorithm for suitable coalition forming in multi-agent system. Suitable coalition denotes a coalition which is not formed in super-additive environment and so it depends on its size and members. Aim of this thesis was to adjust an algorithm for coalition bounds forming between agents in a way, that it is applicable in a multi-agent competition MASSIM. Key aspects are amount of messages sent between agents for coalition to form and also a time it takes to calculate all coalitional values required for such a process. Final scenario is where two competitive groups of agents compete for resources in a multi-agent system simulation.
|
|
|
Coalition Games in a Dynamic Multiagent Environment
Hamran, Peter ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
The essence of this bachelor thesis was to implement an algorithm for suitable coalition forming in multi-agent system. Suitable coalition denotes a coalition which is not formed in super-additive environment and so it depends on its size and members. Aim of this thesis was to adjust an algorithm for coalition bounds forming between agents in a way, that it is applicable in a multi-agent competition MASSIM. Key aspects are amount of messages sent between agents for coalition to form and also a time it takes to calculate all coalitional values required for such a process. Final scenario is where two competitive groups of agents compete for resources in a multi-agent system simulation.
|
|
|
Coalition Formation in Multiagent Systems Using Genetic Algorithms
Kučera, Tomáš ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
This thesis discusses the basics of software agents and the way they form the multiagent coalitions. Genetic algorithms are introduced as one of the methods of solving the coalition formation problem. MAPC 2018 competition is introduced, which inspired the final design and implementation of the solution by using the tools described. A demo project was created, in which agents communicate with the MASSim server and gather data which is then used as an input into the genetic algorithm. Its purpose is to assign the agents to the tasks based on the input data, so that the tasks can be accomplished in the most effective manner possible. The results of this algorithm are evaluated in experiments which are focused on the quality of the solutions found as well as the time required for the calculation.
|
guest ::
